Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine
نویسندگان
چکیده
منابع مشابه
On Implementing Push-relabel Method for the Maximum Flow Problem
We study e cient implementations of the push-relabel method for the maximum ow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of problems for which all known methods seem to have almost quadratic time growth rate. Andrew V. Goldberg...
متن کاملThe Partial Augment-Relabel Algorithm for the Maximum Flow Problem
The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel algorithm, has been a benchmark due to its robust performance. We propose another variant of the push-relabel method, the partial augment-relabel (PAR) algorithm. Our experiments show that PAR is very robust. It outperforms HI...
متن کاملTwo-Level Push-Relabel Algorithm for the Maximum Flow Problem
We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families.
متن کاملEfficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and absolute speedups of our algorithm on a set ...
متن کاملA New Push-Relabel Algorithm for the Maximum Flow Problem
In this paper, we present a faster push-relabel algorithm for the maximum flow problem on bounded-degree networks with n vertices and m arcs. We show how to compute a maximum flow in O(mn) time. This matches the results of Orlin’s algorithm, which runs in O(mn + m log n) time on general networks (and O(mn) time on bounded-degree networks). Our main result is improving on the generic push-relabe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991